Tie-breaking for EDF on multiprocessor platforms
نویسندگان
چکیده
Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. When scheduling using EDF on multiprocessor platforms, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in EDF priorities due to coincident deadlines. We show that no optimal ambiguity solver can be online. We also show that no optimal static tiebreaker exists even if we relax the on-line property.
منابع مشابه
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor pla...
متن کاملFurther improved schedulability analysis of EDF on multiprocessor platforms TR-051001
This report shows how to tighten the analysis of global EDF scheduling on multiprocessor platforms, so as to verify the feasibility of a significantly larger range of task systems than has been possible using the previously known tests, including those recently by Bertogna, Cirinei, and Lipari. The improved EDF feasibility test for sporadic task systems with arbitrary deadlines is proven correc...
متن کاملThe Multi Supply Function Resource Abstraction for Multiprocessors: the Global EDF case
Abstractions are powerful models that allow to isolate the applications as well as to port an existing applications onto new platforms. At the same time, the multiprocessor will become the dominant computing device in the near future. The paper proposes a technique to abstract to computing power of a parallel machine. We compare with the existing abstractions and we develop the global EDF sched...
متن کاملA Comparison of Global EDF and LLREF Scheduling Algorithms
In this paper we are going to analyze and trying to compare EDF and LLREF scheduling algorithms, used in multiprocessor platforms. We will briefly describe classic EDF, global EDF, which is an extension of EDF, and the newer LLREF algorithm. Then we will analyze the ability of global EDF in scheduling task sets in random manner and compare with the LLREF one, which can schedule any task set whe...
متن کاملExact Feasibility Tests for Real-Time Scheduling of Periodic Tasks upon Multiprocessor Platforms
In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so restrictive assumptions, we show that feasible schedules of periodic task systems are periodic from some point with a period equal to ...
متن کامل